Sufficient Conditions for 2-Dimensional Global Rigidity
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 23 October 2020Accepted: 07 July 2021Published online: 19 2021Keywordsrigid graph, redundant rigidity, global essential connectivityAMS Subject Headings05C40, 05C75Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
منابع مشابه
Sufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملRigidity in Finite-Element Matrices: Sufficient Conditions for the Rigidity of Structures and Substructures
We present an algebraic theory of rigidity for finite-element matrices. The theory provides a formal algebraic definition of finite-element matrices; notions of rigidity of finite-element matrices and of mutual rigidity between two such matrices; and sufficient conditions for rigidity and mutual rigidity. We also present a novel sparsification technique, called fretsaw extension, for finite-ele...
متن کاملSufficient conditions for univalence and starlikeness
It is known that the condition $mathfrak {Re} left{zf'(z)/f(z)right}>0$, $|z|
متن کاملGlobal rigidity of 3-dimensional cone-manifolds
We prove global rigidity for compact hyperbolic and spherical cone-3-manifolds with cone-angles ≤ π (which are not Seifert fibered in the spherical case), furthermore for a class of hyperbolic cone-3-manifolds of finite volume with cone-angles ≤ π, possibly with boundary consisting of totally geodesic hyperbolic turnovers. To that end we first generalize the local rigidity result contained in [...
متن کاملNecessary Conditions for the Global Rigidity of Direction-Length Frameworks
It is an intriguing open problem to give a combinatorial characterisation or polynomial algorithm for determining when a graph is globally rigid in R. This means that any generic realisation is uniquely determined up to congruence when each edge represents a fixed length constraint. Hendrickson gave two natural necessary conditions, one involving connectivity and the other redundant rigidity. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1375498